Idempotent Computation over Finite Fields

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Classical Wavelet Transforms over Finite Fields

This article introduces a systematic study for computational aspects of classical wavelet transforms over finite fields using tools from computational harmonic analysis and also theoretical linear algebra. We present a concrete formulation for the Frobenius norm of the classical wavelet transforms over finite fields. It is shown that each vector defined over a finite field can be represented as...

متن کامل

Classical wavelet systems over finite fields

This article presents an analytic approach to study admissibility conditions related to classical full wavelet systems over finite fields using tools from computational harmonic analysis and theoretical linear algebra. It is shown that for a large class of non-zero window signals (wavelets), the generated classical full wavelet systems constitute a frame whose canonical dual are classical full ...

متن کامل

Structure of finite wavelet frames over prime fields

‎This article presents a systematic study for structure of finite wavelet frames‎ ‎over prime fields‎. ‎Let $p$ be a positive prime integer and $mathbb{W}_p$‎ ‎be the finite wavelet group over the prime field $mathbb{Z}_p$‎. ‎We study theoretical frame aspects of finite wavelet systems generated by‎ ‎subgroups of the finite wavelet group $mathbb{W}_p$.

متن کامل

Motives over Finite Fields

The category of motives over the algebraic closure of a finite field is known to be a semisimple Q-linear Tannakian category, but unless one assumes the Tate conjecture there is little further one can say about it. However, once this conjecture is assumed, it is possible to give an almost entirely satisfactory description of the category together with its standard fibre functors. In particular ...

متن کامل

ICA over Finite Fields

Independent Component Analysis is usually performed over the fields of reals or complex numbers and the only other field where some insight has been gained so far is GF(2), the finite field with two elements. We extend this to arbitrary finite fields, proving separability of the model if the sources are non-uniform and non-degenerate and present algorithms performing this task. Usually, Indepen...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Symbolic Computation

سال: 1994

ISSN: 0747-7171

DOI: 10.1006/jsco.1994.1015